package _11_整理题目._7_查找排序._1_排序算法;

import org.junit.Test;

import java.util.Arrays;

public class _03_归并排序 {
    
    public void mergeSort(int[] array, int left, int right) {
        if (left == right) return;
        int mid = left + ((right-left) >> 1);
        mergeSort(array, left, mid);
        mergeSort(array, mid+1, right);
        merge(array, left, mid, right);
    }
    
    public void merge(int[] array, int left, int mid, int right) {
        
    }
    
    @Test
    public void main() {
        int[] input = {1,4,6,2,5,3,8};
        System.out.println(Arrays.toString(input));
        mergeSort(input, 0, input.length-1);
        System.out.println(Arrays.toString(input));
    }
}
